On maximal intermediate predicate constructive logics

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On maximal intermediate predicate constructive logics

We extend to the predicate frame a previous characterization of the maximal intermediate propositional constructive logics. This provides a technique to get maximal intermediate predicate constructive logics starting from suitable sets of classically valid predicate formulae we call maximal nonstandard predicate constructive logics. As an example of this technique, we exhibit two maximal interm...

متن کامل

A short proof of Glivenko theorems for intermediate predicate logics

We give a simple proof-theoretic argument showing that Glivenko’s theorem for propositional logic and its version for predicate logic follow as an easy consequence of the deduction theorem, which also proves some Glivenko type theorems relating intermediate predicate logics between intuitionistic and classical logic. We consider two schemata, the double negation shift (DNS) and the one consisti...

متن کامل

On the Relative Expressiveness of Description Logics and Predicate Logics

It is natural to view concept and role definitions in Description Logics as expressing monadic and dyadic predicates in Predicate Calculus. We show that the descriptions built using the constructors usually considered in the DL literature are characterized exactly as the predicates definable by formulas in L̈3, the subset of First Order Predicate Calculus with monadic and dyadic predicates which...

متن کامل

Monadic Fuzzy Predicate Logics

Two variants of monadic fuzzy predicate logic are analyzed and compared with the full fuzzy predicate logic with respect to nite model property (properties) and arithmetical complexity of sets of tautologies, satis-able formulas and of analogous notion restricted to nite models.

متن کامل

On Reduced Semantics for Fuzzy Predicate Logics

Our work is a contribution to the model-theoretic study of equality-free fuzzy predicate logics. We present a reduced semantics and we prove a completeness theorem of the logics with respect to this semantics. The main concepts being studied are the Leibniz congruence and the relative relation. On the one hand, the Leibniz congruence of a model identifies the elements that are indistinguishable...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Studia Logica

سال: 1996

ISSN: 0039-3215,1572-8730

DOI: 10.1007/bf00370841